Cuts of Linear Orders
نویسندگان
چکیده
We study the connection between the number of ascending and descending cuts of a linear order, its classical size, and its effective complexity (how much [how little] information can be encoded into it).
منابع مشابه
Maximum sum element orders of all proper subgroups of PGL(2, q)
In this paper we show that if q is a power of a prime p , then the projective special linear group PSL(2, q) and the stabilizer of a point of the projective line have maximum sum element orders among all proper subgroups of projective general linear group PGL(2, q) for q odd and even respectively
متن کاملCharacterization of some projective special linear groups in dimension four by their orders and degree patterns
Let $G$ be a finite group. The degree pattern of $G$ denoted by $D(G)$ is defined as follows: If $pi(G)={p_{1},p_{2},...,p_{k}}$ such that $p_{1}
متن کاملMinimal Infeasible Subsystems and Benders cuts
There are many situations in mathematical programming where cutting planes can be generated by solving a certain “cut generation linear program” whose feasible solutions define a family of valid inequalities for the problem at hand. Disjunctive cuts and Benders cuts are two familiar examples. In this paper we concentrate on classical Benders cuts, as they belong to the basic toolbox for mixed-i...
متن کاملComputing with Multi-Row Intersection Cuts
Cutting planes are one of the main techniques currently used to solve large-scale MixedInteger Linear Programming (MIP) models. Many important cuts used in practice, such as Gomory Mixed-Integer (GMI) cuts, are obtained by solving the linear relaxation of the MIP, extracting a single row of the simplex tableau, then applying integrality arguments to it. A natural extension, which has received r...
متن کاملOn Cuts in Ultraproducts of Linear Orders Ii
We continue our study of the class C (D), where D is a uniform ultrafilter on a cardinal κ and C (D) is the class of all pairs (θ1, θ2), where (θ1, θ2) is the cofinality of a cut in Jκ/D and J is some (θ1 + θ2)-saturated dense linear order. We give a combinatorial characterization of the class C (D). We also show that if (θ1, θ2) ∈ C (D) and D is א1-complete or θ1 + θ2 > 2κ, then θ1 = θ2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 28 شماره
صفحات -
تاریخ انتشار 2011